Advanced Hardware Design for Error Correcting Codes by Cyrille Chavet & Philippe Coussy

Author:Cyrille Chavet & Philippe Coussy
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham

Fig. 5.15Path calculation unit (PCU)

Fig. 5.16Partial Euclidean distance calculation unit (PEDCU)

The MFU is used to select the best L = 2 path metrics from QL = 32 candidates. This type of (32, 2) sorting can be done quickly by using a comparison tree. Note that the sorting cost of the trellis-based detector is much lower compared with the regular K-best detector which typically requires a larger (QK, K) sorting operation.

The PEU implements the path extension algorithm. As previously discussed, a path extension process is employed after the path reduction process to fill in the missing paths for each node so that every node will have L shortest paths through the trellis. The PEU has a very similar architecture to the PRU. The PEU employs Q = 16 PCUs and Q = 16 MFUs so that it can simultaneously extend Q nodes in a certain trellis stage. The PEU has a recursive architecture. In each iteration, PCU i calculates the QL extended path candidates based on the L input path metrics, and then, the MFU i selects the best L paths from these QL extended path candidates. The initial L input path metrics are retrieved from the PM Buffer, and, then, the PEU performs the path extension operation recursively.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.